Invariant Logic: A Calculus for Problem Reformulation

نویسنده

  • Michael R. Lowry
چکیده

Symmetries abound in nature. Observing symmetries often provides the key to discovering internal structure. In problem solving, observing and reasoning about symmetries is a powerful tool for shifting viewpoints on a problem. A calculus for reasoning about problem symmetries has been developed, called Invariant Logic. Invariant Logic is partially implemented in STRATA, a system which synthesizes algorithms through problem reformulation. In STRATA, Invariant Logic is used to reason about generalized problem symmetries for several purposes. The first purpose is as a calculus for generating expressions denoting problem symmetries. The second purpose is problem abstraction generating abstract problem descriptions which denote models in which the problem symmetries have been collapsed. The third purpose is problem reduction specializing a problem description by adding constraints in order to realize performance gains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propositional Temporal Proving with Reductions to a SAT Problem

We present a new approach to reasoning in propositional linear-time temporal logic (PLTL). The method is based on the simplified temporal resolution calculus. We prove that the search for premises to apply the rules of simplified temporal resolution can be re-formulated as a search for minimal unsatisfiable subsets (MUS) in a set of classical propositional clauses. This reformulation reduces a ...

متن کامل

Eecient Local Model-checking for Fragments of the Modal -calculus

This paper develops eecient local model-checking algorithms for expressive fragments of the modal-calculus. The time complexity of our procedures matches that of the best existing global algorithms; however, in contrast to those routines, ours explore a system's state space in a need-driven fashion and do not require its a priori construction. Consequently, our algorithms should perform better ...

متن کامل

A Unified Display Proof Theory for Bunched Logic

We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics. Our calculi satisfy cut-elimination, and are sound and complete with respect to their standard presentations. We show that the standard sequent calculus for BI can be seen as a reformulation of its display calculus, and argue that analog...

متن کامل

(Leftmost-Outermost) Beta Reduction is Invariant, Indeed

Slot and van Emde Boas’ weak invariance thesis states that reasonable machines can simulate each other within a polynomial overhead in time. Is λ-calculus a reasonable machine? Is there a way to measure the computational complexity of a λ-term? This paper presents the first complete positive answer to this long-standing problem. Moreover, our answer is completely machine-independent and based o...

متن کامل

Invariant functions for solving multiplicative discrete and continuous ordinary differential equations

In this paper, at first the elemantary and basic concepts of multiplicative discrete and continous differentian and integration introduced. Then for these kinds of differentiation invariant functions the general solution of discrete and continous multiplicative differential equations will be given. Finaly a vast class of difference equations with variable coefficients and nonlinear difference e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988